M.S. Burgin

THEORY OF SUPER-RECURSIVE ALGORITHMS

Selected Publications

  1. Super-recursive Algorithms as a Tool for High Performance Computing // Proceedings of the High Performance Computing Symposium , San Diego, 1999, pp. 224-228

    2.  
  2. Is it Possible to Compute Non-computable or why Programmers Need the Theory of Algorithms, Computers & Software, 1996, N5, pp. 4-8        (in Russian, in collaboration)

    3.  
  3. Operations with Trans-recursive Operators, Cybernetics and System Analysis, 1994, N4, pp. 3-11          (in Russian, in collaboration)

    4.  
  4. Problems of Artificial Intelligence and Trans-recursive operators, Visnik of the National Academy of Sciences of Ukraine, 1994, N 11-12, pp. 29-34            (in Ukrainian, in collaboration)

    5.  
  5. Operations and Compositions in Trans-recursive Operators, Notices of the Russian Academy of Sciences, 1994, v.336, N6 (v.49, N3)        (translated from Russian, in collaboration)

    6.  
  6. Alphabetic operators and algorithms, Cybernetics and System Analysis, 1993, N3, pp. 42-57       (in Russian, in collaboration)

    7.  
  7. Social processes and limit computations, Catastrophe, Chaos, and Self-Organization in Social Systems, Koblenz, 1993, pp. 117-123     (in collaboration)

    8.  
  8. Procedures of sociological measurements, Catastrophe, Chaos, and Self-Organization in Social Systems, Koblenz, 1993, pp. 125-129

    9.  
  9. Universal limit Turing machines, Notices of the Russian Academy of Sciences, 1992, v.325, N4, pp. 654-658      (translated from Russian)

    10.  
  10. Inductive Turing Machines, Notices of the Academy of Sciences of the USSR, 1983, 270 N6, pp.1289-1293       (translated from Russian, v. 27, N3 )

    11.  
  11. Inductive Turing Machines with multiple head and Kolmogorov algorithms, Notices of the Academy of Sciences of the USSR, 1984, 275, N2, pp. 280-284      (translated from Russian)

    12.  
  12. Algorithms and Algorithmic Problems, Programming, 1985, N4, pp. 3-14        (translated from Russian)

    13.  
  13. Limit Computations and Computational Potential of Inductive Turing Machines, All-Union Conference in Applied Logic, Novosibirsk, 1985, pp. 30-32               (in Russian)

    14.  
  14. The Notion of Algorithm and the Turing-Church’s Thesis, VIII International Congress on logic, methodology and philosophy of science, Moscow, 1987, v. 5, part 1, pp. 138-140

    15.  
  15. Arithmetic Hierarchy and Inductive Turing Machines, Notices of the Academy of Sciences of the USSR, 1988, 299, N3, pp. 390-393              (translated from Russian)